Redesign Based Optimization for Distributed Databases
نویسندگان
چکیده
The execution process of the queries in distributed databases require accurate estimations and predictions for performance characteristics. The problems of data allocation and query optimization done by means of mobile agents and evolutionary algorithms are considered. These problems still present a challenge because of the dynamic changes in number of components and architectural complexity of nowadays system topologies. The distributed system is modeled as a graph structure on which is de ned a dynamic cost vector. The cost vector remains consistent, relevant, by use of mobile agents performing cost statistics and vector updates. An evolutionary technique for the re-design phase is proposed. Experimental results prove the e ciency of the proposed technique.
منابع مشابه
Stepwise Redesign of Distributed Relational Databases Y Stepwise Redesign of Distributed Relational Databases 2
Designing distributed databases is an issue of paramount importance for executing transactions eeciently. The distributed database design process consists of three phases namely, the initial design, redesign and materialization of the redesign. The initial design consists of a fragmentation and an allocation scheme which minimize the irrelevant data access cost and data transfer cost. Over a pe...
متن کاملMaterialization of Redesigned Distributed Relational Databases 1 Kamalakar Karlapalem
The changes in the distributed database environment during its lifetime necessitate a redesign of the distributed databases so as to keep the performance of the applications/transactions from degrading. Till now most of the work in distributed database design dealt with developing better fragmentation and allocation algorithms. This paper introduces an hitherto unexplored step in distributed da...
متن کاملOptimization of majority protocol for controlling transactions concurrency in distributed databases by multi-agent systems
In this paper, we propose a new concurrency control algorithm based on multi-agent systems which is an extension of majority protocol. Then, we suggest a clustering approach to get better results in reliability, decreasing message passing and algorithm’s runtime. Here, we consider n different transactions working on non-conflict data items. Considering execution efficiency of some different...
متن کاملA Methodology for Query Processing over Distributed XML Databases
The constant increase in the volume of data stored as native XML documents makes fragmentation techniques an important alternative to the performance issues in query processing over these data. Fragmented databases are feasible only if there is a transparent way to query the distributed database, without the need of knowing the fragmentation details and where each fragment is located. This pape...
متن کاملA Minimal-Model Based Horizontal Fragmentation Algorithm for Disjunctive Deductive Databases
Disjunctive deductive databases (DDDBs) capture indefinite information, i.e., imprecise or partial knowledge of the real world, and are more general than definite deductive databases that can only represent unconditionally true facts. Formal approaches for fragmenting a DDDB, with a view to distribute the DDDB and then design a query optimization strategy for the distributed DDDB, are lacking. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005